Uncapacitated Metric Facility Location Problem (umfl)

نویسندگان

  • Nguyen Kim Thang
  • Finn R. Jensen
چکیده

• Let L be a set of locations. • Let F ⊂ L be a set of potential facility locations. • Let C ⊂ L be a set of clients (cities). • Let c : L × L → R ∀i, j ∈ L be a distance function. Alternatively think of the function as describing the cost of assigning city j to facility i. • Let f : F → R ∀i ∈ F be a cost function describing the cost of opening a facility at i. • Let φ : C → F ∀j ∈ C be an assignment function. I.e. φ(j) = i if city j is assigned to facility i.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cuckoo search via Levy flights applied to uncapacitated facility location problem

Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...

متن کامل

On Fault-Tolerant Facility Location

We give a new LP-rounding 1.724-approximation algorithm for the metric Fault-Tolerant Uncapacitated Facility Location problem. This improves on the previously best known 2.076-approximation algorithm of Shmoys & Swamy. Our work applies a dependent-rounding technique in the domain of facility location. The analysis of our algorithm benefits from, and extends, methods developed for Uncapacitated ...

متن کامل

Integrating facility location and production planning decisions

Weconsider ametric uncapacitated facility locationproblem where we must assign each customer to a facility and meet the demand of the customer in future time periods through production and inventory decisions at the facility. We show that the problem, in general, is as hard to approximate as the set cover problem. We therefore focus on developing approximation algorithms for special cases of th...

متن کامل

A Cultural Algorithm Applied in a Bi-Objective Uncapacitated Facility Location Problem

Cultural Algorithms (CAs) are one of the metaheuristics which can adapt in order to work in multi-objectives optimization environments. On the other hand, Bi-Objective Uncapacitated Facility Location Problem (BOUFLP) and particularly Uncapacitated Facility Location Problem (UFLP) are a well know problems in literature. However, a few articles have worked in the sense of applied evolutionary mul...

متن کامل

Approximation Algorithms for Metric Facility Location Problems

In this paper we present a 1.52-approximation algorithm for the metric uncapacitated facility location problem, and a 2-approximation algorithm for the metric capacitated facility location problem with soft capacities. Both these algorithms improve the best previously known approximation factor for the corresponding problem, and our soft-capacitated facility location algorithm achieves the inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010